TSTP Solution File: SEV181^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEV181^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 09:41:39 EDT 2024

% Result   : Theorem 0.21s 0.38s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   41 (  18 unt;   5 typ;   0 def)
%            Number of atoms       :  185 (  88 equ;   0 cnn)
%            Maximal formula atoms :    6 (   5 avg)
%            Number of connectives :  301 (  39   ~;  17   |;  25   &; 194   @)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   96 (  96   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   5 usr;   3 con; 0-2 aty)
%                                         (   0  !!;  15  ??;   0 @@+;   0 @@-)
%            Number of variables   :   82 (  37   ^  40   !;   4   ?;  82   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(func_def_0,type,
    cD_FOR_X5309: ( ( $i > $o ) > $i ) > $i > $o ).

thf(func_def_12,type,
    sK0: ( $i > $o ) > $i ).

thf(func_def_14,type,
    sK2: $i > $o ).

thf(func_def_15,type,
    ph3: 
      !>[X0: $tType] : X0 ).

thf(func_def_16,type,
    sK4: $i > $i > $o ).

thf(f59,plain,
    $false,
    inference(trivial_inequality_removal,[],[f58]) ).

thf(f58,plain,
    $true = $false,
    inference(duplicate_literal_removal,[],[f45]) ).

thf(f45,plain,
    ( ( $true = $false )
    | ( $true = $false ) ),
    inference(superposition,[],[f44,f22]) ).

thf(f22,plain,
    ( $false
    = ( sK2 @ ( sK0 @ sK2 ) ) ),
    inference(not_proxy_clausification,[],[f21]) ).

thf(f21,plain,
    ( $true
    = ( ~ ( sK2 @ ( sK0 @ sK2 ) ) ) ),
    inference(binary_proxy_clausification,[],[f19]) ).

thf(f19,plain,
    ( $true
    = ( ~ ( sK2 @ ( sK0 @ sK2 ) )
      & ( ( sK0 @ sK2 )
        = ( sK0
          @ ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) ) ) ) ),
    inference(beta_eta_normalization,[],[f18]) ).

thf(f18,plain,
    ( $true
    = ( ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) )
      @ sK2 ) ),
    inference(sigma_clausification,[],[f17]) ).

thf(f17,plain,
    ( $true
    = ( ?? @ ( $i > $o )
      @ ^ [Y0: $i > $o] :
          ( ~ ( Y0 @ ( sK0 @ Y0 ) )
          & ( ( sK0 @ Y0 )
            = ( sK0
              @ ^ [Y1: $i] :
                  ( ?? @ ( $i > $o )
                  @ ^ [Y2: $i > $o] :
                      ( ~ ( Y2 @ ( sK0 @ Y2 ) )
                      & ( ( sK0 @ Y2 )
                        = Y1 ) ) ) ) ) ) ) ),
    inference(beta_eta_normalization,[],[f16]) ).

thf(f16,plain,
    ( $true
    = ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) )
      @ sK0
      @ ( sK0
        @ ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y2: $i > $o] :
                  ( ~ ( Y2 @ ( Y0 @ Y2 ) )
                  & ( ( Y0 @ Y2 )
                    = Y1 ) ) )
          @ sK0 ) ) ) ),
    inference(definition_unfolding,[],[f13,f15,f15]) ).

thf(f15,plain,
    ( cD_FOR_X5309
    = ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) ) ) ),
    inference(cnf_transformation,[],[f8]) ).

thf(f8,plain,
    ( cD_FOR_X5309
    = ( ^ [Y0: ( $i > $o ) > $i,Y1: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y2: $i > $o] :
              ( ~ ( Y2 @ ( Y0 @ Y2 ) )
              & ( ( Y0 @ Y2 )
                = Y1 ) ) ) ) ),
    inference(fool_elimination,[],[f7]) ).

thf(f7,plain,
    ( ( ^ [X0: ( $i > $o ) > $i,X1: $i] :
        ? [X2: $i > $o] :
          ( ( ( X0 @ X2 )
            = X1 )
          & ~ ( X2 @ ( X0 @ X2 ) ) ) )
    = cD_FOR_X5309 ),
    inference(rectify,[],[f1]) ).

thf(f1,axiom,
    ( ( ^ [X0: ( $i > $o ) > $i,X1: $i] :
        ? [X2: $i > $o] :
          ( ( ( X0 @ X2 )
            = X1 )
          & ~ ( X2 @ ( X0 @ X2 ) ) ) )
    = cD_FOR_X5309 ),
    file('/export/starexec/sandbox2/tmp/tmp.IwQOf9trfP/Vampire---4.8_1560',cD_FOR_X5309_def) ).

thf(f13,plain,
    ( $true
    = ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) ) ),
    inference(cnf_transformation,[],[f12]) ).

thf(f12,plain,
    ( ! [X1: $i > $o,X2: $i > $o] :
        ( ( ( sK0 @ X1 )
         != ( sK0 @ X2 ) )
        | ( X1 = X2 ) )
    & ( $true
      = ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f11]) ).

thf(f11,plain,
    ( ? [X0: ( $i > $o ) > $i] :
        ( ! [X1: $i > $o,X2: $i > $o] :
            ( ( ( X0 @ X2 )
             != ( X0 @ X1 ) )
            | ( X1 = X2 ) )
        & ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
          = $true ) )
   => ( ! [X2: $i > $o,X1: $i > $o] :
          ( ( ( sK0 @ X1 )
           != ( sK0 @ X2 ) )
          | ( X1 = X2 ) )
      & ( $true
        = ( cD_FOR_X5309 @ sK0 @ ( sK0 @ ( cD_FOR_X5309 @ sK0 ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f10,plain,
    ? [X0: ( $i > $o ) > $i] :
      ( ! [X1: $i > $o,X2: $i > $o] :
          ( ( ( X0 @ X2 )
           != ( X0 @ X1 ) )
          | ( X1 = X2 ) )
      & ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
        = $true ) ),
    inference(ennf_transformation,[],[f9]) ).

thf(f9,plain,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ! [X1: $i > $o,X2: $i > $o] :
            ( ( ( X0 @ X2 )
              = ( X0 @ X1 ) )
           => ( X1 = X2 ) )
       => ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
         != $true ) ),
    inference(flattening,[],[f6]) ).

thf(f6,plain,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ! [X1: $i > $o,X2: $i > $o] :
            ( ( ( X0 @ X2 )
              = ( X0 @ X1 ) )
           => ( X1 = X2 ) )
       => ( ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) )
         != $true ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ! [X1: $i > $o,X2: $i > $o] :
            ( ( ( X0 @ X2 )
              = ( X0 @ X1 ) )
           => ( X1 = X2 ) )
       => ~ ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ) ),
    inference(rectify,[],[f3]) ).

thf(f3,negated_conjecture,
    ~ ! [X0: ( $i > $o ) > $i] :
        ( ! [X4: $i > $o,X3: $i > $o] :
            ( ( ( X0 @ X3 )
              = ( X0 @ X4 ) )
           => ( X3 = X4 ) )
       => ~ ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ) ),
    inference(negated_conjecture,[],[f2]) ).

thf(f2,conjecture,
    ! [X0: ( $i > $o ) > $i] :
      ( ! [X4: $i > $o,X3: $i > $o] :
          ( ( ( X0 @ X3 )
            = ( X0 @ X4 ) )
         => ( X3 = X4 ) )
     => ~ ( cD_FOR_X5309 @ X0 @ ( X0 @ ( cD_FOR_X5309 @ X0 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.IwQOf9trfP/Vampire---4.8_1560',cTHM143C_pme) ).

thf(f44,plain,
    ! [X0: $i > $o] :
      ( ( $true
        = ( sK2 @ ( sK0 @ X0 ) ) )
      | ( $true
        = ( X0 @ ( sK0 @ X0 ) ) ) ),
    inference(equality_resolution,[],[f37]) ).

thf(f37,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( ( sK0 @ X2 )
       != X1 )
      | ( $true
        = ( X2 @ ( sK0 @ X2 ) ) )
      | ( $true
        = ( sK2 @ X1 ) ) ),
    inference(equality_proxy_clausification,[],[f36]) ).

thf(f36,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( $true
        = ( sK2 @ X1 ) )
      | ( $true
        = ( X2 @ ( sK0 @ X2 ) ) )
      | ( ( ( sK0 @ X2 )
          = X1 )
        = $false ) ),
    inference(not_proxy_clausification,[],[f35]) ).

thf(f35,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( ( ~ ( X2 @ ( sK0 @ X2 ) ) )
        = $false )
      | ( ( ( sK0 @ X2 )
          = X1 )
        = $false )
      | ( $true
        = ( sK2 @ X1 ) ) ),
    inference(binary_proxy_clausification,[],[f34]) ).

thf(f34,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( ( ~ ( X2 @ ( sK0 @ X2 ) )
          & ( ( sK0 @ X2 )
            = X1 ) )
        = $false )
      | ( $true
        = ( sK2 @ X1 ) ) ),
    inference(beta_eta_normalization,[],[f33]) ).

thf(f33,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( $true
        = ( sK2 @ X1 ) )
      | ( $false
        = ( ^ [Y0: $i > $o] :
              ( ~ ( Y0 @ ( sK0 @ Y0 ) )
              & ( ( sK0 @ Y0 )
                = X1 ) )
          @ X2 ) ) ),
    inference(pi_clausification,[],[f32]) ).

thf(f32,plain,
    ! [X1: $i] :
      ( ( ( ?? @ ( $i > $o )
          @ ^ [Y0: $i > $o] :
              ( ~ ( Y0 @ ( sK0 @ Y0 ) )
              & ( ( sK0 @ Y0 )
                = X1 ) ) )
        = $false )
      | ( $true
        = ( sK2 @ X1 ) ) ),
    inference(binary_proxy_clausification,[],[f30]) ).

thf(f30,plain,
    ! [X1: $i] :
      ( ( ?? @ ( $i > $o )
        @ ^ [Y0: $i > $o] :
            ( ~ ( Y0 @ ( sK0 @ Y0 ) )
            & ( ( sK0 @ Y0 )
              = X1 ) ) )
      = ( sK2 @ X1 ) ),
    inference(beta_eta_normalization,[],[f29]) ).

thf(f29,plain,
    ! [X1: $i] :
      ( ( ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) )
        @ X1 )
      = ( sK2 @ X1 ) ),
    inference(argument_congruence,[],[f28]) ).

thf(f28,plain,
    ( ( ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) ) )
    = sK2 ),
    inference(equality_resolution,[],[f25]) ).

thf(f25,plain,
    ! [X0: $i > $o] :
      ( ( ( sK0 @ X0 )
       != ( sK0 @ sK2 ) )
      | ( ( ^ [Y0: $i] :
              ( ?? @ ( $i > $o )
              @ ^ [Y1: $i > $o] :
                  ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                  & ( ( sK0 @ Y1 )
                    = Y0 ) ) ) )
        = X0 ) ),
    inference(superposition,[],[f14,f23]) ).

thf(f23,plain,
    ( ( sK0
      @ ^ [Y0: $i] :
          ( ?? @ ( $i > $o )
          @ ^ [Y1: $i > $o] :
              ( ~ ( Y1 @ ( sK0 @ Y1 ) )
              & ( ( sK0 @ Y1 )
                = Y0 ) ) ) )
    = ( sK0 @ sK2 ) ),
    inference(equality_proxy_clausification,[],[f20]) ).

thf(f20,plain,
    ( $true
    = ( ( sK0 @ sK2 )
      = ( sK0
        @ ^ [Y0: $i] :
            ( ?? @ ( $i > $o )
            @ ^ [Y1: $i > $o] :
                ( ~ ( Y1 @ ( sK0 @ Y1 ) )
                & ( ( sK0 @ Y1 )
                  = Y0 ) ) ) ) ) ),
    inference(binary_proxy_clausification,[],[f19]) ).

thf(f14,plain,
    ! [X2: $i > $o,X1: $i > $o] :
      ( ( ( sK0 @ X1 )
       != ( sK0 @ X2 ) )
      | ( X1 = X2 ) ),
    inference(cnf_transformation,[],[f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEV181^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% 0.03/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35  % Computer : n017.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 11:37:51 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a TH0_THM_EQU_NAR problem
% 0.15/0.35  Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.IwQOf9trfP/Vampire---4.8_1560
% 0.21/0.37  % (1732)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.21/0.37  % (1722)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.21/0.37  % (1726)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.21/0.37  % (1725)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.21/0.37  % (1724)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.21/0.37  % (1727)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.21/0.37  % (1730)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.21/0.37  % (1731)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.21/0.37  % (1726)Instruction limit reached!
% 0.21/0.37  % (1726)------------------------------
% 0.21/0.37  % (1726)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (1726)Termination reason: Unknown
% 0.21/0.37  % (1726)Termination phase: Saturation
% 0.21/0.37  % (1727)Instruction limit reached!
% 0.21/0.37  % (1727)------------------------------
% 0.21/0.37  % (1727)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (1727)Termination reason: Unknown
% 0.21/0.37  % (1727)Termination phase: Property scanning
% 0.21/0.37  
% 0.21/0.37  % (1727)Memory used [KB]: 895
% 0.21/0.37  % (1727)Time elapsed: 0.003 s
% 0.21/0.37  % (1727)Instructions burned: 2 (million)
% 0.21/0.37  % (1727)------------------------------
% 0.21/0.37  % (1727)------------------------------
% 0.21/0.37  
% 0.21/0.37  % (1726)Memory used [KB]: 895
% 0.21/0.37  % (1726)Time elapsed: 0.003 s
% 0.21/0.37  % (1726)Instructions burned: 2 (million)
% 0.21/0.37  % (1726)------------------------------
% 0.21/0.37  % (1726)------------------------------
% 0.21/0.37  % (1730)Refutation not found, incomplete strategy
% 0.21/0.37  % (1730)------------------------------
% 0.21/0.37  % (1730)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (1730)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.37  
% 0.21/0.37  
% 0.21/0.37  % (1730)Memory used [KB]: 5500
% 0.21/0.37  % (1730)Time elapsed: 0.003 s
% 0.21/0.37  % (1730)Instructions burned: 2 (million)
% 0.21/0.37  % (1730)------------------------------
% 0.21/0.37  % (1730)------------------------------
% 0.21/0.37  % (1732)Instruction limit reached!
% 0.21/0.37  % (1732)------------------------------
% 0.21/0.37  % (1732)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (1732)Termination reason: Unknown
% 0.21/0.37  % (1732)Termination phase: Saturation
% 0.21/0.37  
% 0.21/0.37  % (1732)Memory used [KB]: 5500
% 0.21/0.37  % (1732)Time elapsed: 0.004 s
% 0.21/0.37  % (1732)Instructions burned: 3 (million)
% 0.21/0.37  % (1732)------------------------------
% 0.21/0.37  % (1732)------------------------------
% 0.21/0.37  % (1724)Instruction limit reached!
% 0.21/0.37  % (1724)------------------------------
% 0.21/0.37  % (1724)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37  % (1724)Termination reason: Unknown
% 0.21/0.37  % (1724)Termination phase: Saturation
% 0.21/0.37  
% 0.21/0.37  % (1724)Memory used [KB]: 5500
% 0.21/0.37  % (1724)Time elapsed: 0.005 s
% 0.21/0.37  % (1724)Instructions burned: 4 (million)
% 0.21/0.37  % (1724)------------------------------
% 0.21/0.37  % (1724)------------------------------
% 0.21/0.38  % (1731)First to succeed.
% 0.21/0.38  % (1725)Also succeeded, but the first one will report.
% 0.21/0.38  % (1731)Refutation found. Thanks to Tanya!
% 0.21/0.38  % SZS status Theorem for Vampire---4
% 0.21/0.38  % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.38  % (1731)------------------------------
% 0.21/0.38  % (1731)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38  % (1731)Termination reason: Refutation
% 0.21/0.38  
% 0.21/0.38  % (1731)Memory used [KB]: 5500
% 0.21/0.38  % (1731)Time elapsed: 0.008 s
% 0.21/0.38  % (1731)Instructions burned: 6 (million)
% 0.21/0.38  % (1731)------------------------------
% 0.21/0.38  % (1731)------------------------------
% 0.21/0.38  % (1721)Success in time 0.009 s
% 0.21/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------